Lectures, scientific papers, top secret wartime material, correspondence, and broadcasts are introduced and set in context by Jack Copeland, Director of the Turing Archive for the History of Computing."--Jacket.

Do the dynamics of a physical system determine what function the system computes? Except in special cases, the answer is no: it is often indeterminate what function a given physical system computes. Accordingly, care should be taken when the question ‘What does a particular neuronal system do?’ is answered by hypothesising that the system computes a particular function. The phenomenon of the indeterminacy of computation has important implications for the development of computational explanations of biological systems. Additionally, the phenomenon lends (...) some support to the idea that a single neuronal structure may perform multiple cognitive functions, each subserved by a different computation. We provide an overarching conceptual framework in order to further the philosophical debate on the nature of computational indeterminacy and computational explanation. (shrink)

Michel Foucault's concept of normalisation is taken as a basis to explore the factors involved in the identification of dull, deficient and backward pupils in British Elementary Education between 1870 and 1914. Normalisation consists of the five processes of comparison, differentiation, hierarchisation, homogenisation and exclusion. These processes operate through dividing practices which distribute groups socially and are supported in this work by scientific ideas. In this instance, the norm of the intellect is the basis of the dividing practices. The empirical (...) focus opens with an examination of the main features of Elementary education. It then moves to consider the deliberations of the Royal Commission on the Blind, Deaf and Dumb, etc and those of the Departmental Committee on Defective and Epileptic Children. The analysis concludes with a consideration of the consequences of the Elementary Education Act, 1899, and its effects up until 1914. (shrink)

Alan Turing, pioneer of computing and WWII codebreaker, is one of the most important and influential thinkers of the twentieth century. In this volume for the first time his key writings are made available to a broad, non-specialist readership. They make fascinating reading both in their own right and for their historic significance: contemporary computational theory, cognitive science, artificial intelligence, and artificial life all spring from this ground-breaking work, which is also rich in philosophical and logical insight.

The concept of social reproduction of sets of advantages and disadvantages together with that of status group, is used to explore the evidence and thinking presented in the Royal Commission on the Blind, the Deaf and Dumb, etc. regarding the education of children with disabilities in 1889. Even though the evidence was ambiguous, models for the education of children with disabilities were laid down. Integration into mainstream elementary schools was recommended for the blind. Recommendations for deaf children were divided in (...) allegiance with belief in the principles of either oralism or signing. The largest group numerically received the least attention in the Commission. The idea of feeble-minded children as a product of social, economic and educational circumstances had its champion but was overwhelmed by the acceptance of the doctrine of the innate characteristics of the child's mind identifiable by medical science. (shrink)

An increasingly popular solution to the anti-scientific climate rising on social media platforms has been the appeal to more critical thinking from the user's side. In this paper, we zoom in on the ideal of critical thinking and unpack it in order to see, specifically, whether it can provide enough epistemic agency so that users endowed with it can break free from enclosed communities on social media (so called epistemic bubbles). We criticise some assumptions embedded in the ideal of critical (...) thinking online and, instead, we propose that a better way to understand the virtuous behaviour at hand is as critical engagement, namely a mutual cultivation of critical skills among the members of an epistemic bubble. This mutual cultivation allows members within an epistemic bubble (in contrast, as we will show, with the authority-based models of epistemic echo chambers) to become more autonomous critical thinkers by cultivating self-trust. We use the model of relational autonomy as well as resources from work on epistemic self-trust and epistemic interdependence to develop an explanatory framework, which in turn may ground rules for identifying and creating virtuous epistemic bubbles within the environments of social media platforms. (shrink)

The prelims comprise: The Birth of the Modern Computer What is a Turing Machine? The Basic Operations of a Turing Machine Human Computation The Church—Turing Thesis Beyond the Universal Turing Machine Misunderstandings of the Church—Turing Thesis: The Limits of Machines Conclusion.

There are various equivalent formulations of the Church-Turing thesis. A common one is that every effective computation can be carried out by a Turing machine. The Church-Turing thesis is often misunderstood, particularly in recent writing in the philosophy of mind.

La proposition de cet article est de se saisir du « temps de l’expérience » des parcs éoliens citoyens en Frise du Nord (Allemagne) en le confrontant à la fois aux pulsations politiques des expérimentations techniques et à la fois aux rythmes des vents, comme ce qui permettrait d’en prendre soin, pour penser la continuité des épreuves de transition dans le temps mais aussi dans l’espace, dans une perspective démocratique de multiplication des expériences de transition.

Presupposing no familiarity with the technical concepts of either philosophy or computing, this clear introduction reviews the progress made in AI since the inception of the field in 1956. Copeland goes on to analyze what those working in AI must achieve before they can claim to have built a thinking machine and appraises their prospects of succeeding. There are clear introductions to connectionism and to the language of thought hypothesis which weave together material from philosophy, artificial intelligence and neuroscience. (...) John Searle's attacks on AI and cognitive science are countered and close attention is given to foundational issues, including the nature of computation, Turing Machines, the Church-Turing Thesis and the difference between classical symbol processing and parallel distributed processing. The book also explores the possibility of machines having free will and consciousness and concludes with a discussion of in what sense the human brain may be a computer. (shrink)

To compute is to execute an algorithm. More precisely, to say that a device or organ computes is to say that there exists a modelling relationship of a certain kind between it and a formal specification of an algorithm and supporting architecture. The key issue is to delimit the phrase of a certain kind. I call this the problem of distinguishing between standard and nonstandard models of computation. The successful drawing of this distinction guards Turing's 1936 analysis of computation against (...) a difficulty that has persistently been raised against it, and undercuts various objections that have been made to the computational theory of mind. (shrink)

This article contributes to recent work on justice in resilience-based projects for climate adaptation. At present, the model commonly used for guiding normative reflection in this domain is the tripartite model of justice, whereby justice is seen as comprising distributive, procedural and recognitional aspects. After discussing some conceptual problems and practical shortcomings of this model, we propose an alternative model with six forms of justice or kinds of justice demands: distributive, procedural, intergenerational, restorative and retributive justice, and justice in system (...) outcomes. We also illustrate some advantages of this model with respect to representative accounts of the tripartite model. (shrink)

This article traces the development of possible worlds semantics through the work of: Wittgenstein, 1913-1921; Feys, 1924; McKinsey, 1945; Carnap, 1945-1947; McKinsey, Tarski and Jónsson, 1947-1952; von Wright, 1951; Becker, 1952; Prior, 1953-1954; Montague, 1955; Meredith and Prior, 1956; Geach, 1960; Smiley, 1955-1957; Kanger, 1957; Hintikka, 1957; Guillaume, 1958; Binkley, 1958; Bayart, 1958-1959; Drake, 1959-1961; Kripke, 1958-1965.

A survey of the field of hypercomputation, including discussion of a variety of objections.

Turing''s test has been much misunderstood. Recently unpublished material by Turing casts fresh light on his thinking and dispels a number of philosophical myths concerning the Turing test. Properly understood, the Turing test withstands objections that are popularly believed to be fatal.

Presupposing no familiarity with the technical concepts of either philosophy or computing, this clear introduction reviews the progress made in AI since the inception of the field in 1956. Copeland goes on to analyze what those working in AI must achieve before they can claim to have built a thinking machine and appraises their prospects of succeeding.There are clear introductions to connectionism and to the language of thought hypothesis which weave together material from philosophy, artificial intelligence and neuroscience. John (...) Searle's attacks on AI and cognitive science are countered and close attention is given to foundational issues, including the nature of computation, Turing Machines, the Church-Turing Thesis and the difference between classical symbol processing and parallel distributed processing. The book also explores the possibility of machines having free will and consciousness and concludes with a discussion of in what sense the human brain may be a computer. (shrink)

Abstract‘Serendipity’ is a category used to describe discoveries in science that occur at the intersection of chance and wisdom. In this paper, I argue for understanding serendipity in science as an emergent property of scientific discovery, describing an oblique relationship between the outcome of a discovery process and the intentions that drove it forward. The recognition of serendipity is correlated with an acknowledgment of the limits of expectations about potential sources of knowledge. I provide an analysis of serendipity in science (...) as a defense of this definition and its implications, drawing from theoretical and empirical research on experiences of serendipity as they occur in science and elsewhere. I focus on three interrelated features of serendipity in science. First, there are variations of serendipity. The process of serendipitous discovery can be complex. Second, a valuable outcome must be obtained before reflection upon the significance of the unexpected observation or event in respect to that outcome can take place. Therefore, serendipity is retrospectively categorized. Third, the primacy of epistemic expectations is elucidated. Finally, I place this analysis within discussions in philosophy of science regarding the impact of interpersonal competition upon the number and significance of scientific discoveries. Thus, the analysis of serendipity offered in this paper contributes to discussions about the social-epistemological aspects of scientific discovery and has normative implications for the structure of epistemically effective scientific communities. (shrink)

A scholastic-Cartesian schema faithfully maps ordinary, effective ways of dealing with intentionality; yet its apparent incoherence provokes philosophers into opting for one of two stances, 'Cartesian' or 'direct realist', seemingly incompatible, yet each seem in accord with ordinary thought. A wide range of canonical and current theories, realist, idealist and hybrid, essentially involve one option or the other. We should instead consider why the language of intentionality, with its apparent anomalies, works so well. Released from the obligation to opt for (...) one stance over the other, we can identify a robust realism different in kind from anything currently on offer. (shrink)

‘Serendipity’ is a category used to describe discoveries in science that occur at the intersection of chance and wisdom. In this paper, I argue for understanding serendipity in science as an emergent property of scientific discovery, describing an oblique relationship between the outcome of a discovery process and the intentions that drove it forward. The recognition of serendipity is correlated with an acknowledgment of the limits of expectations about potential sources of knowledge. I provide an analysis of serendipity in science (...) as a defense of this definition and its implications, drawing from theoretical and empirical research on experiences of serendipity as they occur in science and elsewhere. I focus on three interrelated features of serendipity in science. First, there are variations of serendipity. The process of serendipitous discovery can be complex. Second, a valuable outcome must be obtained before reflection upon the significance of the unexpected observation or event in respect to that outcome can take place. Therefore, serendipity is retrospectively categorized. Third, the primacy of epistemic expectations is elucidated. Finally, I place this analysis within discussions in philosophy of science regarding the impact of interpersonal competition upon the number and significance of scientific discoveries. Thus, the analysis of serendipity offered in this paper contributes to discussions about the social-epistemological aspects of scientific discovery and has normative implications for the structure of epistemically effective scientific communities. (shrink)

Electoral control refers to attempts by an election's organizer to influence the outcome by adding/deleting/partitioning voters or candidates. The important paper of Bartholdi, Tovey, and Trick [1] that introduces control proposes computational complexity as a means of resisting control attempts: Look for election systems where the chair's task in seeking control is itself computationally infeasible.We introduce and study a method of combining two or more candidate-anonymous election schemes in such a way that the combined scheme possesses all the resistances to (...) control possessed by any of its constituents: It combines their strengths. From this and new resistance constructions, we prove for the first time that there exists a neutral, anonymous election scheme that is resistant to all twenty standard types of electoral control. (shrink)

Accelerating Turing machines are Turing machines of a sort able to perform tasks that are commonly regarded as impossible for Turing machines. For example, they can determine whether or not the decimal representation of contains n consecutive 7s, for any n; solve the Turing-machine halting problem; and decide the predicate calculus. Are accelerating Turing machines, then, logically impossible devices? I argue that they are not. There are implications concerning the nature of effective procedures and the theoretical limits of computability. Contrary (...) to a recent paper by Bringsjord, Bello and Ferrucci, however, the concept of an accelerating Turing machine cannot be used to shove up Searle's Chinese room argument. (shrink)

Accelerating Turing machines have attracted much attention in the last decade or so. They have been described as “the work-horse of hypercomputation” (Potgieter and Rosinger 2010: 853). But do they really compute beyond the “Turing limit”—e.g., compute the halting function? We argue that the answer depends on what you mean by an accelerating Turing machine, on what you mean by computation, and even on what you mean by a Turing machine. We show first that in the current literature the term (...) “accelerating Turing machine” is used to refer to two very different species of accelerating machine, which we call end-stage-in and end-stage-out machines, respectively. We argue that end-stage-in accelerating machines are not Turing machines at all. We then present two differing conceptions of computation, the internal and the external, and introduce the notion of an epistemic embedding of a computation. We argue that no accelerating Turing machine computes the halting function in the internal sense. Finally, we distinguish between two very different conceptions of the Turing machine, the purist conception and the realist conception; and we argue that Turing himself was no subscriber to the purist conception. We conclude that under the realist conception, but not under the purist conception, an accelerating Turing machine is able to compute the halting function in the external sense. We adopt a relatively informal approach throughout, since we take the key issues to be philosophical rather than mathematical. (shrink)

Famous examples of conceivability arguments include (i) Descartes’ argument for mind-body dualism, (ii) Kripke's ‘modal argument’ against psychophysical identity theory, (iii) Chalmers’ ‘zombie argument’ against materialism, and (iv) modal versions of the ontological argument for theism. In this paper, we show that for any such conceivability argument, C, there is a corresponding ‘mirror argument’, M. M is deductively valid and has a conclusion that contradicts C's conclusion. Hence, a proponent of C—henceforth, a ‘conceivabilist’—can be warranted in holding that C's premises (...) are conjointly true only if she can find fault with one of M's premises. But M's premises are modelled on a pair of C's premises. The same reasoning that supports the latter supports the former. For this reason, a conceivabilist can repudiate M's premises only on pain of severely undermining C's premises. We conclude on this basis that all conceivability arguments, including each of (i)–(iv), are fallacious. (shrink)

A myth has arisen concerning Turing's paper of 1936, namely that Turing set forth a fundamental principle concerning the limits of what can be computed by machine - a myth that has passed into cognitive science and the philosophy of mind, to wide and pernicious effect. This supposed principle, sometimes incorrectly termed the 'Church-Turing thesis', is the claim that the class of functions that can be computed by machines is identical to the class of functions that can be computed by (...) Turing machines. In point of fact Turing himself nowhere endorses, nor even states, this claim (nor does Church). I describe a number of notional machines, both analogue and digital, that can compute more than a universal Turing machine. These machines are exemplars of the class of _nonclassical_ computing machines. Nothing known at present rules out the possibility that machines in this class will one day be built, nor that the brain itself is such a machine. These theoretical considerations undercut a number of foundational arguments that are commonly rehearsed in cognitive science, and gesture towards a new class of cognitive models. (shrink)

Turing’s analysis of computability has recently been challenged; it is claimed that it is circular to analyse the intuitive concept of numerical computability in terms of the Turing machine. This claim threatens the view, canonical in mathematics and cognitive science, that the concept of a systematic procedure or algorithm is to be explicated by reference to the capacities of Turing machines. We defend Turing’s analysis against the challenge of ‘deviant encodings’.Keywords: Systematic procedure; Turing machine; Church–Turing thesis; Deviant encoding; Acceptable encoding; (...) Turing’s analysis of computability; Turing’s Notational Thesis. (shrink)